Minimum Crosstalk Vertical Layer Assignment for Three-Layer VHV Channel Routing

Crosstalk Minimization in Three-Layer HVH Channel Routing

Crosstalk has become a major issue in VLSI design due to the high fr equency, long interconnecting lines and small spacing between interconnects in today's integrated circuits. In this paper, we study the problem of crosstalk minimization in 3-layer HVH channel routing. A heuristic algorithm that combines layer reassignment and track reassignment is presented. This algorithm can iteratively mod...

Minimum Separation for Single-Layer Channel Routing

We provide a linear-time algorithm for determining the minimum separation required to route a channel when the connections can be realized in one layer. Differing from the usual “river-routing” context, we allow single-sided connections. The algorithm also works directly for problems with multiterminal nets and does not require wires to lie on an underlying grid, though it does use the rectilin...

Algorithms for Reducing Crosstalk in Two-Layer Channel Routing

Crosstalk minimization is one of the most important high performance aspects in interconnecting VLSI circuits. With advancement of fabrication technology, devices and interconnecting wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Crosstalk minimization problem for the reserved two-layer Manhattan channel routing ...

Single phase three-layer channel routing algorithms

We present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the following algorithms developed by Mehlhorn et al. (1986): (i) The algorithm that generates planar layouts for the two-terminal net CRP with dmax tracks. (ii) The algorithm that generates planar layouts for the twoand three-...

Layer Assignment for Rubber Band Routing